On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation
نویسندگان
چکیده
In this paper we study random genetic drift in a nite genetic population Exact formulae for calculating the mean convergence time of the population are analytically derived and some results of numerical calculations are given The calculations are compared to the results obtained in population genetics A new proposition is derived for binary alleles and uniform crossover Here the mean convergence time is almost proportional to the size of the population and to the logarithm of the number of the loci The results of Monte Carlo type numerical simulations are in agreement with the results from the calculation
منابع مشابه
New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملخوشهبندی خودکار دادهها با بهرهگیری از الگوریتم رقابت استعماری بهبودیافته
Imperialist Competitive Algorithm (ICA) is considered as a prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optim...
متن کاملDetermination of Optimal Parameters for Finite Plates with a Quasi-Square Hole
This paper aims at optimizing the parameters involved in stress analysis of perforated plates, in order to achieve the least amount of stress around the square-shaped holes located in a finite isotropic plate using metaheuristic optimization algorithms. Metaheuristics may be classified into three main classes: evolutionary, physics-based, and swarm intelligence algorithms. This research uses Ge...
متن کاملAppraisal of the evolutionary-based methodologies in generation of artificial earthquake time histories
Through the last three decades different seismological and engineering approaches for the generation of artificial earthquakes have been proposed. Selection of an appropriate method for the generation of applicable artificial earthquake accelerograms (AEAs) has been a challenging subject in the time history analysis of the structures in the case of the absence of sufficient recorded accelerogra...
متن کاملOPTIMIZATION OF STEEL MOMENT FRAME BY A PROPOSED EVOLUTIONARY ALGORITHM
This paper presents an improved multi-objective evolutionary algorithm (IMOEA) for the design of planar steel frames. By considering constraints as a new objective function, single objective optimization problems turned to multi objective optimization problems. To increase efficiency of IMOEA different Crossover and Mutation are employed. Also to avoid local optima dynamic interference of mutat...
متن کامل